Adaptively Biased Sequential Importance Sampling for Rare Events in Reaction Networks with Comparison with Exact Solutions from Finite Buffer dCME Method
نویسندگان
چکیده
1 Critical events that occur rarely in biological processes are of great importance, but are challenging to study using Monte Carlo simulation. By introducing biases to reaction selection and reaction rates, weighted stochastic simulation algorithms based on importance sampling allow rare events to be sampled more effectively. However, existing methods do not address the important issue of barrier crossing, which often arises from multistable networks and systems with complex probability landscape. In addition, the proliferation of parameters and the associated computing cost pose significant problems. Here we introduce a general theoretical framework for obtaining optimized biases in sampling individual reactions for estimating probabilities of rare events. We further describe a practical algorithm called adaptively biased sequential importance sampling (ABSIS) method for efficient probability estimation. By adopting a look-ahead strategy and by enumerating short paths from the current state, we estimate the reaction-specific and state-specific forward and backward moving probabilities of the system, which are then used to bias reaction selections. The ABSIS algorithm can automatically detect barrier-crossing region, and can adjust bias adaptively at different steps of the sampling process, with bias determined by the outcome of exhaustively generated short paths. In addition, there are only two bias parameters to determine, regardless of the number of the reactions and the complexity of the network. We have applied the ABSIS method to four biochemical networks: the birth-death process, the reversible isomerization, the bistable Schlögle model, and the enzyme futile cycle model. For comparison, we have also applied the finite buffer discrete chemical master equation method recently developed to obtain exact numerical solutions of the underlying discrete chemical master equations to these problems. This allows us to assess sampling results objectively by comparing simulation results with true answers. Overall, ABSIS can accurately and efficiently estimate rare event probabilities for all examples, often with smaller variance than other importance sampling algorithms. The ABSIS method is general and can be applied to study rare events of other stochastic networks with complex probability landscape.
منابع مشابه
Adaptively biased sequential importance sampling for rare events in reaction networks with comparison to exact solutions from finite buffer dCME method.
Critical events that occur rarely in biological processes are of great importance, but are challenging to study using Monte Carlo simulation. By introducing biases to reaction selection and reaction rates, weighted stochastic simulation algorithms based on importance sampling allow rare events to be sampled more effectively. However, existing methods do not address the important issue of barrie...
متن کاملAccurate Chemical Master Equation Solution Using Multi-Finite Buffers
The discrete chemical master equation (dCME) provides a fundamental framework for studying stochasticity in mesoscopic networks. Because of the multi-scale nature of many networks where reaction rates have large disparity, directly solving dCMEs is intractable due to the exploding size of the state space. It is important to truncate the state space effectively with quantified errors, so accurat...
متن کاملNonparametric Adaptive Importance Sampling for Rare Event Simulation
Simulating rare events in telecommunication networks such as estimation for cell loss probability in Asynchronous Transfer Mode (ATM) networks requires a major simulation effort due to the slight chance of buffer overflow. Importance Sampling (IS) is applied to accelerate the occurrence of rare events. Importance Sampling depends on a biasing scheme to make the estimator from IS unbiased. Adapt...
متن کاملAsymptotically optimal importance sampling for Jackson networks with a tree topology
Importance sampling (IS) is a variance reduction method for simulating rare events. A recent paper by Dupuis, Wang and Sezer (Ann. App. Probab. 17(4):13061346, 2007) exploits connections between IS and subsolutions to a limit HJB equation and its boundary conditions to show how to design and analyze simple and efficient IS algorithms for various overflow events for tandem Jackson networks. The ...
متن کاملAdaptive state- dependent importance sampling simulation of markovian queueing networks
In this paper, a method is presented for the efficient estimation of rare-event (buffer overflow) probabilities in queueing networks using importance sampling. Unlike previously proposed change of measures, the one used here is not static, i.e., it depends on the buffer contents at each of the network nodes. The ‘optimal’ state-dependent change of measure is determined adaptively during the sim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013